#include "map.h"
#include <stdio.h>
#include <stdlib.h>

int hash(const char *key){
   int hash = 0;
   char c;
   int length = 0;
   while(*(key+length) != '\0') length++;
   for(length -= 1;length > 0;length--){
    	hash = 31 * hash + (*(key+length));
    }
    return hash;
}

TreeNode* buildNode(const char *key,void *value){
    TreeNode* treeNode = (TreeNode*)malloc(sizeof(TreeNode));
    return treeNode;
}

void put(TreeNode *root,const char *key,void *value){

}

void* get(char *key) {
    
}



